Nuprl Lemma : ecl-es-halt-ecl-halt 11,40

ds:fpf(Id; x.Type), da:fpf(Knd; k.Type), x:ecl(dsda), es:event_system{i:l}, i:Id.
(x:Id. subtype_rel(es-vartype(esix); fpf-cap(ds; id-deq; x; top)))
 (e:es-E(es). (loc(e) = i subtype_rel(es-valtype(ese); ma-valtype(da; es-kind(ese))))
 (n:e1,e2:{e:es-E(es)| loc(e) = i} .
 (ecl-es-halt(esx)(n,e1,e2))  (ecl-halt(dsdax)(n,es-hist{i:l}(es;e1;e2)))) 
latex


DefinitionsP  Q, x:AB(x), prop{i:l}, t  T, xt(x), event-info(ds;da), ma-valtype(dak), es-hist{i:l}(es;e1;e2), top, P  Q, P  Q, P  Q, x:AB(x), A c B, guard(T), sq_type(T), l_all(LTx.P(x)), A, False, Y, map(fas), subtype(ST), i <z j, b, i j, nth_tl(n;as), hd(l), ||as||, l[i], if b then t else f fi , ff, tt, null(as), last(L), b, append(asbs), True, T, e[e1,e2).P(e), P  Q, e[e1,e2].P(e), es-le(esee'), ecl-halt(dsdax), A  B, , e(e1,e2].P(e), (x  l), x,yt(x;y), star-append(TPQ), [e1;e2]~([a,b].p(a;b))*[a,b].q(a;b), ecl-es-halt(esx), lelt(ijk), int_seg(ij), reduce(fkas), (i = j), upto(n), concat(ll), suptype(ST), l_exists(LTx.P(x)), x(s), e2 = first e  e1.P(e), decidable(P), t.2, t.1, es-info(es;e), es-locl(esee'), spreadn(ax,y,z.t(x;y;z)), Unit, , e[e1,e2].P(e), x(s1,s2), , trans(Tx,y.E(x;y)),
Lemmases-loc wf, es-hist wf, ecl-es-halt wf, iff wf, top wf, Kind-deq wf, fpf-cap wf, last lemma, null-es-hist, es-locl wf, null wf3, assert wf, not functionality wrt iff, es-interval wf, es-E wf, map wf, es-le-not-locl, l member wf, not wf, l all wf2, append wf, event-info wf, Knd sq, es-vartype wf, es-state-subtype, nil member, decidable false, length wf1, decidable es-le, decidable es-locl, es-interval-is-nil, non neg length, length-append, false wf, last append, pi1 wf, pi2 wf, last-es-hist, bool wf, true wf, squash wf, es-le wf, es-info wf, es-loc-pred, es-le-loc, es-locl-iff, es-pred wf, member-es-hist, es-le-pred, es-le weakening eq, es-locl transitivity1, es-hist-partition, general-append-cancellation, nat wf, length wf nat, es-interval-eq, es-val wf, Id wf, es-state-when wf, es-kind wf, le wf, ecl-halt wf, assert of bnot, eqff to assert, bnot wf, assert of eq int, eqtt to assert, iff transitivity, bool sq, eq int wf, bool cases, es-hist-is-append, ecl-halt-nil, iseg wf, decl-state wf, es-hist-iseg, es-le-iff, ecl-halt-ex, alle-between2 wf, assert of lt int, bnot of le int, lt int wf, alle-between1 wf, assert of le int, le int wf, select wf, l-all-iff, nat plus wf, nat plus inc, ecl-ex wf, iseg-es-hist, existse-between2 wf, eclrepeat wf, id-deq wf, ma-valtype wf, es-valtype wf, star-append wf, es-pstar-q wf, ifthenelse wf, upto wf, int seg wf, es-first wf, member map, decidable int equal, nat plus properties, es-le-trans, concat append, map append sq, concat wf, append assoc sq, append-nil, decidable assert, assert of null, es-hist-is-concat, Id sq, select member, eclact wf, subtype rel wf, eclthrow wf, eclcatch wf, l exists wf

origin